Reputation-Based Investment Helps to Optimize Group Behaviors in Spatial Lattice Networks
نویسندگان
چکیده
Encouraging cooperation among selfish individuals is crucial in many real-world systems, where individuals' collective behaviors can be analyzed using evolutionary public goods game. Along this line, extensive studies have shown that reputation is an effective mechanism to investigate the evolution of cooperation. In most existing studies, participating individuals in a public goods game are assumed to contribute unconditionally into the public pool, or they can choose partners based on a common reputation standard (e.g., preferences or characters). However, to assign one reputation standard for all individuals is impractical in many real-world deployment. In this paper, we introduce a reputation tolerance mechanism that allows an individual to select its potential partners and decide whether or not to contribute an investment to the public pool based on its tolerance to other individuals' reputation. Specifically, an individual takes part in a public goods game only if the number of participants with higher reputation exceeds the value of its tolerance. Moreover, in this paper, an individual's reputation can increase or decrease in a bounded interval based on its historical behaviors. We explore the principle that how the reputation tolerance and conditional investment mechanisms can affect the evolution of cooperation in spatial lattice networks. Our simulation results demonstrate that a larger tolerance value can achieve an environment that promote the cooperation of participants.
منابع مشابه
GGRA: a grouped gossip-based reputation aggregation algorithm
An important issue in P2P networks is the existence of malicious nodes that decreases the performance of such networks. Reputation system in which nodes are ranked based on their behavior, is one of the proposed solutions to detect and isolate malicious (low ranked) nodes. Gossip Trust is an interesting previously proposed algorithm for reputation aggregation in P2P networks based on t...
متن کاملSecurity-Based Co-Expansion Planning of Gas and Electricity Networks Considering Demand Response
Coordinated expansion planning of power plants has always attracted the attention of power industry planners to arrive at the optimal mix that assures adequacy of energy supply. Here, we model the coordinates for expansion of electricity and gas networks while considering technical constraints, in order to minimize the total cost of investment and operation of electricity and gas networks for a...
متن کاملA Dirichlet reputation system in reliable routing of wireless ad hoc network
Ad hoc networks are very helpful in situations when no fixed network infrastructure is available, such as natural disasters and military conflicts. In such a network, all wireless nodes are equal peers simultaneously serving as both senders and routers for other nodes. Therefore, how to route packets through reliable paths becomes a fundamental problems when behaviors of certain nodes deviate f...
متن کاملEvolving Cooperation in Complex Behavioral Interactions through Reputation
The iterated prisoner’s dilemma (IPD) has long been used to study the conditions that promote cooperative behaviors among selfish individuals. In particular, studies using the co-evolutionary learning framework have shown that cooperative behaviors can be learned through a process of adaptation of strategies based solely on direct interactions through repeated encounters in playing IPD. However...
متن کاملCollective Reputation and the Dynamics of Statistical Discrimination
Previous literature on statistical discrimination explained stereotypes based on the existence of multiple equilibria, in which principals have different self-confirming beliefs about different social groups (Arrow, 1973; Coate and Loury, 1993). However, the literature has not provided an account of where the principals’ prior beliefs come from. Moreover, the static models dominating the litera...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره 11 شماره
صفحات -
تاریخ انتشار 2016